Entanglement of Distillation and Conditional Mutual Information
نویسنده
چکیده
In previous papers, we expressed the Entanglement of Formation in terms of Conditional Mutual Information (CMI). In this brief paper, we express the Entanglement of Distillation in terms of CMI.
منابع مشابه
Computing quantum discord is NP-complete
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum disc...
متن کاملDistillation protocols: output entanglement and local mutual information.
A complementary behavior between local mutual information and average output entanglement is derived for arbitrary bipartite ensembles. This leads to bounds on the yield of entanglement in distillation protocols that involve disinguishing. This bound is saturated in the hashing protocol for distillation, for Bell-diagonal states.
متن کاملRelaxation Method For Calculating Quantum Entanglement
In a previous paper, we showed how entanglement of formation can be defined as a minimum of the quantum conditional mutual information (a.k.a. quantum conditional information transmission). In classical information theory, the Arimoto-Blahut method is one of the preferred methods for calculating extrema of mutual information. We present a new method akin to the Arimoto-Blahut method for calcula...
متن کامل0 Entanglement of Formation and Conditional Information Transmission
We show that the separability of states in quantum mechanics has a close counterpart in classical physics, and that conditional mutual information (a.k.a. conditional information transmission) is a very useful quantity in the study of both quantum and classical separabilities. We also show how to define entanglement of formation in terms of conditional mutual information. This paper lays the th...
متن کاملFaithful Squashed Entanglement with applications to separability testing and quantum Merlin-Arthur games
We derive the lower bound on squashed entanglement from a lower bound on the quantum conditional mutual information, which corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sheds light on the structure of states that almost satisfy strong subadditivity with equality. The proof of the lower bound is based on two recent resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008